Polynomial characteristic sets for DFA identification
نویسندگان
چکیده
We study the order in Grammatical Inference algorithms, and its influence on the polynomial (with respect to the data) identification of languages. This work is motivated by recent results on the polynomial convergence of data-driven grammatical inference algorithms. In this paper, we prove a sufficient condition that assures the existence of a characteristic sample whose size is polynomial with respect to the minimum DFA of the target language. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Identification of DFA: data-dependent versus data-independent algorithms
Algorithms that infer deterministic finite automata from given data and that comply with the identification in the limit condition have been thoroughly tested and are in practice often preferred to elaborate heuristics. Even if there is no guarantee of identification from the available data, the existence of associated characteristic sets means that these algorithms converge towards the correct...
متن کاملIdentification of DFA: data-dependent vs data-independent algorithms
Algorithms that infer deterministic finite automata from given data and that comply with the identification in the limit condition have been thoroughly tested and are in practice often preferred to elaborate heuristics. Even if there is no guarantee of identification from the available data, the existence of associated characteristic sets means that these algorithms converge towards the correct...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملPolynomial-Time Isomorphism of 1-L-Complete Sets
Let C be any complexity class closed under log-lin reductions. We show that all sets complete for C under 1-L reductions are polynomialtime isomorphic to each other. We also generalize the result to reductions computed by finite-crossing machines. As a corollary, we show that all sets complete for C under 2-way DFA reductions are polynomial-time isomorphic to each other.
متن کاملResolution of Fuzzy Complex Systems of Linear Equations Via Wu's Method
The aim of this paper is to present algebraic method which is called Wu's method to solving fuzzy complex systems of linear equations. Wu's method is used as a solution procedure for solving the crisp polynomial equations system. This algorithm leads to solving characteristic sets that are amenable to easy solution. To illustrate the easy application of the proposed method, numerical examples a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 448 شماره
صفحات -
تاریخ انتشار 2012